GO-APSR: A Globally Optimal Affine Point Set Registration Method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Affine iterative closest point algorithm for point set registration

Article history: Received 24 April 2009 Received in revised form 15 January 2010 Available online 25 January 2010 Communicated by Y. Liu

متن کامل

SOAR: Stochastic Optimization for Affine global point set Registration

We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D point clouds with unknown point correspondences. The algorithm recovers the globally optimal scale, rotation, and translation alignment parameters and is applicable in a variety of difficult settings, including very sparse, noisy, and outlierridden datasets that do not permit the computation of loca...

متن کامل

Globally optimal volume registration using DC programming

This paper proposes a novel approach to optimally solve volumetric registration problems. The proposed framework exploits sparse dictionaries for volumetric representations, ! dissimilarities and DC (Difference of Convex functions) decomposition. The SAD (sum of absolute differences) criterion is applied to the sparse representation of the reference volume and a DC decomposition of this criteri...

متن کامل

A Maximum Feasible Subsystem for Globally Optimal 3D Point Cloud Registration

In this paper, a globally optimal algorithm based on a maximum feasible subsystem framework is proposed for robust pairwise registration of point cloud data. Registration is formulated as a branch-and-bound problem with mixed-integer linear programming. Among the putative matches of three-dimensional (3D) features between two sets of range data, the proposed algorithm finds the maximum number o...

متن کامل

A Robust Affine Image Registration Method

Image registration has many real life applications. Affine image registration is one of the commonly-used parametric models. Iterative solution methods for the underlying least squares problem suffer from convergence problems whenever good initial guesses are not available. Variational models are non-parametric deformable models that have been proposed based on least squares fitting and regular...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2019

ISSN: 2169-3536

DOI: 10.1109/access.2019.2942380